On the rate of convergence of certain methods of centers
نویسندگان
چکیده
It is ~hown in this paper that a theoretical method of centers, introduced by Huard, converges linearly. It is also shown, by counter-example, that a modified me thod of centers due to I luard and a method of feas ible direction due to Topkis and Veino! canno t converge linearly even under convexity assumpt ions. Because of this, a new modified method of centers is introduced wh ich uses a quadratic programming direct ion finding su broutine. In most uses this new method 1s not more complicated than ll uard's modified method of centers. But it does converge linearly. A method for implementing it without Joss of rate of convergence is also discussed.
منابع مشابه
On the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملOn convergence of certain nonlinear Durrmeyer operators at Lebesgue points
The aim of this paper is to study the behaviour of certain sequence of nonlinear Durrmeyer operators $ND_{n}f$ of the form $$(ND_{n}f)(x)=intlimits_{0}^{1}K_{n}left( x,t,fleft( tright) right) dt,,,0leq xleq 1,,,,,,nin mathbb{N}, $$ acting on bounded functions on an interval $left[ 0,1right] ,$ where $% K_{n}left( x,t,uright) $ satisfies some suitable assumptions. Here we estimate the rate...
متن کاملModified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملCystoscopy Image Classication Using Deep Convolutional Neural Networks
In the past three decades, the use of smart methods in medical diagnostic systems has attractedthe attention of many researchers. However, no smart activity has been provided in the eld ofmedical image processing for diagnosis of bladder cancer through cystoscopy images despite the highprevalence in the world. In this paper, two well-known convolutional neural networks (CNNs) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 2 شماره
صفحات -
تاریخ انتشار 1972